Quadratic residue codes, rank three groups and PBIBDs
نویسندگان
چکیده
The automorphism group of the Zetterberg code Z length 17 (also a quadratic residue code) is rank three whose orbits on coordinate pairs determine two strongly regular graphs equivalent to Paley graph attached prime 17. As consequence, codewords given weight are characteristic vectors blocks PBIBD with associate classes cyclic type. More generally, this construction PBIBDs extended codes $$\equiv 1 \pmod {8},$$ adjacency triangular and lattice graphs, various graphs. A remarkable fact existence 2-designs held by 41 for weights 9 10.
منابع مشابه
Generalized quadratic residue codes
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملLong Quadratic Residue Codes
A long standing problem has been to develop “good” binary linear block codes, C, to be used for error-correction. The length of the block is denoted n and the dimension of the code is denoted k. So in this notation C ⊆ GF (2) is a k-dimensional subspace. Another important parameter is the smallest weight of any non-zero codeword, d. This is related to error-correction because C can correct [d−1...
متن کاملQuadratic Residue Codes and Divisibility
Quadratic residue codes are some of the brightest gems of coding theory. Their facets reeect many topics: quadratic residues and reciprocity; multiply transitive and sporadic simple groups; lattices; group representations; and block designs and Hadamard matrices. They provide the only perfect codes for prime-power sized alphabets correcting more than one error, and some are prototypes of extrem...
متن کاملOn quadratic residue codes and hyperelliptic curves
For an odd prime p and each non-empty subset S ⊂ GF (p), consider the hyperelliptic curve XS defined by y = fS(x), where fS(x) = Q a∈S(x− a). Using a connection between binary quadratic residue codes and hyperelliptic curves over GF (p), this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S...
متن کاملQuadratic Residue Codes over Z 9
A subset of n tuples of elements of Z9 is said to be a code over Z9 if it is a Z9-module. In this paper we consider an special family of cyclic codes over Z9, namely quadratic residue codes. We define these codes in term of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00918-z